Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search
نویسندگان
چکیده
منابع مشابه
Tabu-based GIS for solving the vehicle routing problem
Besides being a hard combinatorial problem, the VRP is also a spatial problem. Hence, effective decision making in this field strongly requires the integration of GIS and optimization systems (GIS-O). This article integrates GIS and optimization tools for solving the vehicle routing problem with loading and distance requirements (DCVRP). A general outline of the multi-step integration is pointe...
متن کاملInteractive Solving of Vehicle Routing and Scheduling Problems: Basic Concepts and Qualification of Tabu Search Approaches
This paper introduces a framework for the interactive solving of optimization problems and presents an interactive tabu search algorithm for the pick-up-and-delivery problem with time windows (PDPTW). The framework for the development of interactive algorithms is based on the idea of activating and deactivating constraints in the model of the problem under consideration. We start with an introd...
متن کاملA tabu search algorithm for the vehicle routing problem
The purpose of this study is to develop a new tabu seach heuristic to solve the single-depot vehicle routing problem of a distribution company carrying goods from a depot to a set of dedicated dealers. The heuristic proposes a new neighbourhood generation procedure which considers the scattering pattern in the locations of the dealers. A set of neighbours are generated by first executing a proc...
متن کاملTabu Search Heuristics for the Vehicle Routing Problem
This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2004
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(04)90543-2